منابع مشابه
Heuristics for Semirandom Graph Problems
We consider semirandom graph models for nding large independent sets, colorings and bisections in graphs. These models generate problem instances by blending random and adversarial decisions. To generate semirandom independent set problems, an independent set S of n ver-tices is randomly chosen. Each edge connecting S with S is chosen with probability p, and an adversary is then allowed to add ...
متن کاملBurning a graph is hard
We introduce a new graph parameter called the burning number, inspired by contact processes on graphs such as graph bootstrap percolation, and graph searching paradigms such as Firefighter. The burning number measures the speed of the spread of contagion in a graph; the lower the burning number, the faster the contagion spreads. We provide algorithmic results on the burning number, and prove th...
متن کاملBurning Number of Graph Products
Graph burning is a deterministic discrete time graph process that can be interpreted as a model for the spread of influence in social networks. The burning number of a graph is the minimum number of steps in a graph burning process for that graph. In this paper, we consider the burning number of graph products. We find some general bounds on the burning number of the Cartesian product and the s...
متن کاملFaster Streaming algorithms for graph spanners
Given an undirected graph G = (V,E) on n vertices, m edges, and an integer t ≥ 1, a subgraph (V,ES), ES ⊆ E is called a t-spanner if for any pair of vertices u, v ∈ V , the distance between them in the subgraph is at most t times the actual distance. We present streaming algorithms for computing a t-spanner of essentially optimal size-stretch trade offs for any undirected graph. Our first algor...
متن کاملSeed-growth Heuristics for Graph Bisection
We investigate a family of algorithms for graph bisection that are based on a simple local connectivity heuristic, which we call seedgrowth. We show how the heuristic can be combined with stochastic search procedures and a postprocess application of the KernighanLin algorithm. In a series of time-equated comparisons against largesample runs of pure Kernighan-Lin, the new algorithms nd bisection...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Intelligence
سال: 2021
ISSN: 0924-669X,1573-7497
DOI: 10.1007/s10489-021-02411-5